Benefits of Alternating FCFS/SJF Service Order

نویسنده

  • WERNER SANDMANN
چکیده

We apply simulation to evaluate the performance of scheduling according to an alternating FCFS/SJF service order, in particular concerning performance metrics other than delay. Metrics related to social justice, also referred to as quantitative fairness measures, are investigated. We focus on two types of situations that have been previously identified to provoke and increase queued customers’ personal perceptions of social injustice: violations of the FCFS service discipline implying so-called slips and skips or overtaking, and long waiting for single customers. In order to balance the extreme behavior of pure FCFS and pure SJF service order and to improve perceived justice of customers, we propose to alternate between these traditional scheduling policies. We also examine the prize that has to be paid to improve justice oriented queue metrics at the cost of higher expected delay or higher delay variability. That is we compare the potential increase of expected delay and of delay variability to the potential increase of social justice. Discrete-event simulation studies are performed for different interarrival and service time distributions in general single server queues. Our results show that alternating FCFS/SJF scheduling can significantly improve social justice without much worsening the delay metrics. Key–Words: Queueing, Scheduling, Social Justice, Discrimination Frequency, Discrete Event Simulation Study

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Evaluation of Socially Just Scheduling Policies

Queueing for service occurs in technical applications as well as in common daily life, and scheduling should manage queues in a satisfactory way. Performance metrics are influenced by the service order, thus, scheduling policies should be designed with respect to the main performance metrics of interest. For human customers psychological effects and performance metrics other than delay play a c...

متن کامل

Simulation of First Come First Served (FCFS) and Shortest Job First (SJF) Algorithms

Development of scheduling algorithms is directly related with the development of operating system which brings difficulties in implementation. Any modification on the scheduling algorithm will appear as modification on the operating system kernel code. Processor is an important source of cpu scheduling process, so it becomes very important on accomplishing of the operating system design goals. ...

متن کامل

Performance evaluation of nonpreemptive response - ratio

The schedulers of nonpreemptive batch processing systems are often based on the first-come first-serve (FCFS) or shortest-job-first (SJF) algorithms. The former is least discriminating in the sense that it does not base its scheduling decisions on the service requirements of jobs. In the SJF scheme, the service requirement of a job (or at least an estimate for it) must be known at the time of a...

متن کامل

The impact of scheduling policies on the waiting-time distributions in polling systems

We consider polling models consisting of a single server that visits the queues in a cyclic order. In the vast majority of papers that have appeared on polling models, it is assumed that at each of the individual queues, the customers are served on a first-come-first-served (FCFS) basis. In this paper, we study polling models where the local scheduling policy is not FCFS but instead is varied a...

متن کامل

The Effect of Scheduling Discipline on Sender-Initiated and Receiver-Initiated Adaptive Load Sharing in Homogeneous Distributed Systems†

Load sharing is a technique to improve the performance of distributed systems by distributing the system workload from heavily loaded nodes to lightly loaded nodes in the system. Previous studies have considered two adaptive load sharing policies: sender-initiated and receiver-initiated. In the sender-initiated policy, a heavily loaded node attempts to transfer work to a lightly loaded node and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006